-
1 linear automaton
linear automaton linearer Automat mEnglish-German dictionary of Electrical Engineering and Electronics > linear automaton
-
2 linear automaton
Большой англо-русский и русско-английский словарь > linear automaton
-
3 linear automaton
Математика: линейный автомат -
4 linear automaton
-
5 linear automaton
-
6 linear automaton
The New English-Russian Dictionary of Radio-electronics > linear automaton
-
7 linear automaton
мат. -
8 linear automaton
English-Russian dictionary of electronics > linear automaton
-
9 piecewise linear automaton
Электроника: кусочно-линейный автоматУниверсальный англо-русский словарь > piecewise linear automaton
-
10 piecewise linear automaton
English-Russian electronics dictionary > piecewise linear automaton
-
11 piecewise linear automaton
The New English-Russian Dictionary of Radio-electronics > piecewise linear automaton
-
12 piecewise linear automaton
English-Russian dictionary of electronics > piecewise linear automaton
-
13 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automaton -
14 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automatonThe New English-Russian Dictionary of Radio-electronics > automaton
-
15 automaton
- anthropomorphic automaton
- canonical parsing automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite state automaton
- finite-memory automaton
- halting automaton
- infinite automaton
- linear-bounded automaton
- Mealy automaton
- Moore automaton
- nondeterministic automaton
- parsing automaton
- partialy specific automaton
- probabilistic automaton
- push-down automaton
- reduced automaton
- reduced-time automaton
- redundant automaton
- self-adjusting automaton
- self-reproducing automaton
- semireduced parsing automaton
- split parsing automaton
- stochastic automaton
- timed automaton
- two-way automatonEnglish-Russian dictionary of computer science and programming > automaton
-
16 automaton
-
17 automaton
-
18 automaton
[ɔ:ˈtɔmətən]automaton (pl -ta, -tons) автомат automaton вчт. автомат cellular automaton клеточный автомат finite automaton конечный автомат finite-state automaton конечный автомат linear-bounded automaton линейно-ограниченный автомат push-down automaton магазинный автомат sequential automaton секвенциальный автомат -
19 linear-bounded automaton
-
20 linear-bound automaton
English-Russian dictionary of Information technology > linear-bound automaton
См. также в других словарях:
Linear temporal logic — (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths such as that a condition will eventually be true, that a condition will be true until another fact becomes true,… … Wikipedia
Linear bounded automaton — A linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of a non deterministic Turing machine. It possesses a tape made up of cells that can contain symbols from a finite alphabet, a head that can read… … Wikipedia
Linear Bounded Automaton — Eine linear beschränkte Turingmaschine (auch LBA = Linear Bounded Automaton) ist eine Turingmaschine, die den Eingabebereich nicht verlässt. Das bedeutet, dass sie nur den Teil des Bandes benutzt, auf dem zu Beginn das Eingabewort steht. Eine LBA … Deutsch Wikipedia
Linear beschränkte Turing-Maschine — Eine linear beschränkte Turingmaschine (auch LBA = Linear Bounded Automaton) ist eine Turingmaschine, die den Eingabebereich nicht verlässt. Das bedeutet, dass sie nur den Teil des Bandes benutzt, auf dem zu Beginn das Eingabewort steht. Eine LBA … Deutsch Wikipedia
Linear beschränkte Turingmaschine — Eine linear beschränkte Turingmaschine (auch LBA = Linear Bounded Automaton) ist eine Turingmaschine, die den Eingabebereich nicht verlässt. Das bedeutet, dass sie nur den Teil des Bandes benutzt, auf dem zu Beginn das Eingabewort steht. Eine LBA … Deutsch Wikipedia
Linear beschränkter Automat — Eine linear beschränkte Turingmaschine (auch LBA = Linear Bounded Automaton) ist eine Turingmaschine, die den Eingabebereich nicht verlässt. Das bedeutet, dass sie nur den Teil des Bandes benutzt, auf dem zu Beginn das Eingabewort steht. Eine LBA … Deutsch Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Majority problem (cellular automaton) — The majority problem, or density classification task is the problem of finding one dimensional cellular automaton rules that accurately perform majority voting. Using local transition rules, cells cannot know the total count of all the ones in… … Wikipedia
Nested stack automaton — In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks.[1] A nested stack automaton may read its stack, in addition to pushing or popping it. A nested stack… … Wikipedia
Deterministic automaton — is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence. A common deterministic automaton is a deterministic finite state machine (sometimes… … Wikipedia
Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… … Wikipedia